Linear-time algorithms for phylogenetic tree completion under Robinson–Foulds distance
نویسندگان
چکیده
منابع مشابه
Linear-Time Tree Containment in Phylogenetic Networks
We consider the NP-hard Tree Containment problem that has important applications in phylogenetics. The problem asks if a given leaflabeled network contains a subdivision of a given leaf-labeled tree. We develop a fast algorithm for the case that the input network is indeed a tree in which multiple leaves might share a label. By combining this algorithm with a generalization of a previously know...
متن کاملA Distance Metric for Tree-Sibling Time Consistent Phylogenetic Networks
Motivation: The presence of reticulate evolutionary events in phylogenies turn phylogenetic trees into phylogenetic networks. These events imply in particular that there may exist multiple evolutionary paths from a non-extant species to an extant one, and this multiplicity makes the comparison of phylogenetic networks much more difficult than the comparison of phylogenetic trees. In fact, all a...
متن کاملAlgorithms for Phylogenetic Tree Reconstruction
Scientists often wish to use the information contained in the DNA sequences of a collection of organisms, or taxa, to infer the evolutionary relationships among those taxa. These evolutionary relationships are generally represented by a labeled binary tree, called a phylogenetic tree. The phylogeny reconstruction problem is computationally di cult because the number of possible solutions increa...
متن کاملLinear Time Euclidean Distance Transform Algorithms
Two linear time (and hence asymptotically optimal) algorithms for computing the Euclidean distance transform of a two-dimensional binary image are presented. The algorithms are based on the construction and regular sampling of the Voronoi diagram whose sites consist of the unit (feature) pixels in the image. The rst algorithm, which is of primarily theoretical interest, constructs the complete ...
متن کاملTowards Distance-Based Phylogenetic Inference in Average-Case Linear-Time
Computing genetic evolution distances among a set of taxa dominates the running time of many phylogenetic inference methods. Most of genetic evolution distance definitions rely, even if indirectly, on computing the pairwise Hamming distance among sequences or profiles. We propose here an average-case linear-time algorithm to compute pairwise Hamming distances among a set of taxa under a given H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2020
ISSN: 1748-7188
DOI: 10.1186/s13015-020-00166-1